Mean dimension of continuous cellular automata
نویسندگان
چکیده
We investigate the mean dimension of a cellular automaton (CA for short) with compact non-discrete space states. A formula is established (near) strongly permutative, permutative algebraic and unit one-dimensional automata. In higher dimensions, CA or having spaceship has infinite dimension. However, building on Meyerovitch’s example [Mey08], we give an surjective positive finite
منابع مشابه
Continuous Transitions of Cellular Automata
A method of continuously deforming one cellular automaton rule into another is presented. Transitions between behaviors under this model are found to share some characteristics of the dynamics of iterated self-maps.
متن کاملMean Field Models of Probabilistic Cellular Automata
Probabilistic cellular automata (PCA) form a very large and general class of stochastic processes. These automata exhibit a wide range of complicated behavior and are of interest in a number of fields of study, including mathematical physics, percolation theory, computer science, and neurobiology. The models are generally considered on the lattice Z (usually in two dimensions). Very little has ...
متن کاملOrdered cellular automata in one dimension
We study a probabilistic one-dimensional majority-rule two-state cellular automaton and examine the stability of ordered magnetised states in systems of size L as the neighbourhood radius R varies. We find that a scaling R -J In L is suJficient for an ordered phase to be metastable, I-e-, to survive for times much longer than the typical critical fluctuation. The lattice magnetisat ion obeys a ...
متن کاملRadial View of Continuous Cellular Automata
Continuous cellular automata (or coupled map lattices) are cellular automata where the state of the cells are real values in [0, 1] and the local transition rule is a real function. The classical observation medium for cellular automata, whether Boolean or continuous, is the space-time diagram, where successive rows correspond to successive configurations in time. In this paper we introduce a d...
متن کاملCellular Automata and Continuous Functions: Negative Results
Let ω = {0, 1, . . . , n − 1} be a finite alphabet, DN = {1, 2, . . . ,N}, and BN = {x ∈ [0, 1] | ∃k ∈ ! : x = k/nN}. A configuration is a function of the form: ξ : DN → ω, and CN is the set of all configurations. Two configurations ξ1 and ξ2 are near if d(ξ1, ξ2) = (N −A)/N is small, where A = sup{p | ∃i ∈ {0, 1, . . . ,N} : ∀k = i + 1, i + 2, . . . , i + p ≤ N ξ1(k) = ξ2(k)}. The following re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2023
ISSN: ['1565-8511', '0021-2172']
DOI: https://doi.org/10.1007/s11856-023-2493-9